0.03/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.03/0.11 % Command : run_E %s %d THM 0.11/0.31 % Computer : n004.cluster.edu 0.11/0.31 % Model : x86_64 x86_64 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.31 % Memory : 8042.1875MB 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.31 % CPULimit : 960 0.11/0.31 % WCLimit : 120 0.11/0.31 % DateTime : Tue Aug 9 03:12:50 EDT 2022 0.11/0.32 % CPUTime : 0.16/0.49 Running higher-order on 8 cores theorem proving 0.16/0.49 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.16/0.49 # Version: 3.0pre003-ho 0.50/0.63 # Preprocessing class: HSLSSMSMSSSNFFN. 0.50/0.63 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.50/0.63 # Starting sh3 with 600s (5) cores 0.50/0.63 # Starting lpo1_def_fix with 120s (1) cores 0.50/0.63 # Starting lpo8_s with 120s (1) cores 0.50/0.63 # Starting lpo1_lambda_fix with 120s (1) cores 0.50/0.63 # lpo8_s with pid 16669 completed with status 0 0.50/0.63 # Result found by lpo8_s 0.50/0.63 # Preprocessing class: HSLSSMSMSSSNFFN. 0.50/0.63 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.50/0.63 # Starting sh3 with 600s (5) cores 0.50/0.63 # Starting lpo1_def_fix with 120s (1) cores 0.50/0.63 # Starting lpo8_s with 120s (1) cores 0.50/0.63 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0) 0.50/0.63 # ...ProofStateSinE()=686/745 0.50/0.63 # Search class: HGHSM-FSLM31-DFFFFFNN 0.50/0.63 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.50/0.63 # Starting sh3 with 73s (1) cores 0.50/0.63 # sh3 with pid 16678 completed with status 0 0.50/0.63 # Result found by sh3 0.50/0.63 # Preprocessing class: HSLSSMSMSSSNFFN. 0.50/0.63 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.50/0.63 # Starting sh3 with 600s (5) cores 0.50/0.63 # Starting lpo1_def_fix with 120s (1) cores 0.50/0.63 # Starting lpo8_s with 120s (1) cores 0.50/0.63 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,6,20000,1.0) 0.50/0.63 # ...ProofStateSinE()=686/745 0.50/0.63 # Search class: HGHSM-FSLM31-DFFFFFNN 0.50/0.63 # Scheduled 5 strats onto 1 cores with 120 seconds (120 total) 0.50/0.63 # Starting sh3 with 73s (1) cores 0.50/0.63 # Preprocessing time : 0.010 s 0.50/0.63 # Presaturation interreduction done 0.50/0.63 0.50/0.63 # Proof found! 0.50/0.63 # SZS status Theorem 0.50/0.63 # SZS output start CNFRefutation 0.50/0.63 thf(decl_22, type, minus_minus_int: int > int > int). 0.50/0.63 thf(decl_23, type, minus_minus_nat: nat > nat > nat). 0.50/0.63 thf(decl_24, type, minus_minus_real: real > real > real). 0.50/0.63 thf(decl_25, type, one_one_int: int). 0.50/0.63 thf(decl_26, type, one_one_nat: nat). 0.50/0.63 thf(decl_27, type, one_one_real: real). 0.50/0.63 thf(decl_28, type, plus_plus_int: int > int > int). 0.50/0.63 thf(decl_29, type, plus_plus_nat: nat > nat > nat). 0.50/0.63 thf(decl_30, type, plus_plus_real: real > real > real). 0.50/0.63 thf(decl_31, type, times_times_int: int > int > int). 0.50/0.63 thf(decl_32, type, times_times_nat: nat > nat > nat). 0.50/0.63 thf(decl_33, type, times_times_real: real > real > real). 0.50/0.63 thf(decl_34, type, zero_zero_int: int). 0.50/0.63 thf(decl_35, type, zero_zero_nat: nat). 0.50/0.63 thf(decl_36, type, zero_zero_real: real). 0.50/0.63 thf(decl_37, type, zcong: int > int > int > $o). 0.50/0.63 thf(decl_38, type, zprime: int > $o). 0.50/0.63 thf(decl_39, type, bit0: int > int). 0.50/0.63 thf(decl_40, type, bit1: int > int). 0.50/0.63 thf(decl_41, type, min: int). 0.50/0.63 thf(decl_42, type, pls: int). 0.50/0.63 thf(decl_43, type, number_number_of_int: int > int). 0.50/0.63 thf(decl_44, type, number_number_of_nat: int > nat). 0.50/0.63 thf(decl_45, type, number267125858f_real: int > real). 0.50/0.63 thf(decl_46, type, ord_less_int: int > int > $o). 0.50/0.63 thf(decl_47, type, ord_less_nat: nat > nat > $o). 0.50/0.63 thf(decl_48, type, ord_less_real: real > real > $o). 0.50/0.63 thf(decl_49, type, ord_less_eq_int: int > int > $o). 0.50/0.63 thf(decl_50, type, ord_less_eq_nat: nat > nat > $o). 0.50/0.63 thf(decl_51, type, ord_less_eq_real: real > real > $o). 0.50/0.63 thf(decl_52, type, power_power_int: int > nat > int). 0.50/0.63 thf(decl_53, type, power_power_nat: nat > nat > nat). 0.50/0.63 thf(decl_54, type, power_power_real: real > nat > real). 0.50/0.63 thf(decl_55, type, legendre: int > int > int). 0.50/0.63 thf(decl_56, type, quadRes: int > int > $o). 0.50/0.63 thf(decl_57, type, dvd_dvd_int: int > int > $o). 0.50/0.63 thf(decl_58, type, dvd_dvd_nat: nat > nat > $o). 0.50/0.63 thf(decl_59, type, dvd_dvd_real: real > real > $o). 0.50/0.63 thf(decl_60, type, twoSqu362149276sum2sq: int > $o). 0.50/0.63 thf(decl_61, type, m: int). 0.50/0.63 thf(decl_62, type, s1: int). 0.50/0.63 thf(decl_63, type, s: int). 0.50/0.63 thf(decl_64, type, t: int). 0.50/0.63 thf(decl_65, type, esk1_3: int > int > int > int). 0.50/0.63 thf(decl_66, type, esk2_0: int). 0.50/0.63 thf(decl_67, type, esk3_0: int). 0.50/0.63 thf(decl_68, type, esk4_2: real > nat > real). 0.50/0.63 thf(decl_69, type, esk5_1: int > int). 0.50/0.63 thf(decl_70, type, esk6_0: int). 0.50/0.63 thf(decl_71, type, esk7_0: int). 0.50/0.63 thf(decl_72, type, esk8_2: int > int > int). 0.50/0.63 thf(fact_92_zmult__1, axiom, ![X573:int]:(((times_times_int @ one_one_int @ X573)=(X573))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_92_zmult__1)). 0.50/0.63 thf(fact_34_number__of__is__id, axiom, ![X5:int]:(((number_number_of_int @ X5)=(X5))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_34_number__of__is__id)). 0.50/0.63 thf(fact_368_comm__semiring__1__class_Onormalizing__semiring__rules_I6_J, axiom, ![X418:int]:(((plus_plus_int @ X418 @ zero_zero_int)=(X418))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_368_comm__semiring__1__class_Onormalizing__semiring__rules_I6_J)). 0.50/0.63 thf(conj_0, conjecture, (ord_less_int @ (plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int) @ zero_zero_int), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.50/0.63 thf(fact_89_mult__Bit0, axiom, ![X5:int, X6:int]:(((times_times_int @ (bit0 @ X5) @ X6)=(bit0 @ (times_times_int @ X5 @ X6)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_89_mult__Bit0)). 0.50/0.63 thf(fact_253_semiring__norm_I110_J, axiom, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_253_semiring__norm_I110_J)). 0.50/0.63 thf(fact_232_add__Bit0__Bit1, axiom, ![X5:int, X6:int]:(((plus_plus_int @ (bit0 @ X5) @ (bit1 @ X6))=(bit1 @ (plus_plus_int @ X5 @ X6)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_232_add__Bit0__Bit1)). 0.50/0.63 thf(fact_170_Pls__def, axiom, ((pls)=(zero_zero_int)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_170_Pls__def)). 0.50/0.63 thf(fact_35_zmult__commute, axiom, ![X298:int, X7:int]:(((times_times_int @ X298 @ X7)=(times_times_int @ X7 @ X298))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_35_zmult__commute)). 0.50/0.63 thf(fact_328_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J, axiom, ![X455:int, X456:int]:(((plus_plus_int @ X455 @ X456)=(plus_plus_int @ X456 @ X455))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_328_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J)). 0.50/0.63 thf(fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J, axiom, ![X474:int]:(((times_times_int @ X474 @ zero_zero_int)=(zero_zero_int))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J)). 0.50/0.63 thf(fact_3_t, axiom, ((plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int)=(times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ t)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_3_t)). 0.50/0.63 thf(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096, axiom, (ord_less_int @ (times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ t) @ (times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ zero_zero_int)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096)). 0.50/0.63 thf(c_0_13, plain, ![X2577:int]:(((times_times_int @ one_one_int @ X2577)=(X2577))), inference(variable_rename,[status(thm)],[fact_92_zmult__1])). 0.50/0.63 thf(c_0_14, plain, ![X2884:int]:(((number_number_of_int @ X2884)=(X2884))), inference(variable_rename,[status(thm)],[fact_34_number__of__is__id])). 0.50/0.63 thf(c_0_15, plain, ![X2375:int]:(((plus_plus_int @ X2375 @ zero_zero_int)=(X2375))), inference(variable_rename,[status(thm)],[fact_368_comm__semiring__1__class_Onormalizing__semiring__rules_I6_J])). 0.50/0.63 thf(c_0_16, negated_conjecture, ~(ord_less_int @ (plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int) @ zero_zero_int), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.50/0.63 thf(c_0_17, plain, ![X2752:int, X2753:int]:(((times_times_int @ (bit0 @ X2752) @ X2753)=(bit0 @ (times_times_int @ X2752 @ X2753)))), inference(variable_rename,[status(thm)],[fact_89_mult__Bit0])). 0.50/0.63 thf(c_0_18, plain, ![X1:int]:(((times_times_int @ one_one_int @ X1)=(X1))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.50/0.63 thf(c_0_19, plain, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), inference(split_conjunct,[status(thm)],[fact_253_semiring__norm_I110_J])). 0.50/0.63 thf(c_0_20, plain, ![X1:int]:(((number_number_of_int @ X1)=(X1))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.50/0.63 thf(c_0_21, plain, ![X2549:int, X2550:int]:(((plus_plus_int @ (bit0 @ X2549) @ (bit1 @ X2550))=(bit1 @ (plus_plus_int @ X2549 @ X2550)))), inference(variable_rename,[status(thm)],[fact_232_add__Bit0__Bit1])). 0.50/0.63 thf(c_0_22, plain, ![X1:int]:(((plus_plus_int @ X1 @ zero_zero_int)=(X1))), inference(split_conjunct,[status(thm)],[c_0_15])). 0.50/0.63 thf(c_0_23, plain, ((pls)=(zero_zero_int)), inference(split_conjunct,[status(thm)],[fact_170_Pls__def])). 0.50/0.63 thf(c_0_24, plain, ![X2827:int, X2828:int]:(((times_times_int @ X2827 @ X2828)=(times_times_int @ X2828 @ X2827))), inference(variable_rename,[status(thm)],[fact_35_zmult__commute])). 0.50/0.63 thf(c_0_25, plain, ![X2467:int, X2468:int]:(((plus_plus_int @ X2467 @ X2468)=(plus_plus_int @ X2468 @ X2467))), inference(variable_rename,[status(thm)],[fact_328_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J])). 0.50/0.63 thf(c_0_26, plain, ![X2381:int]:(((times_times_int @ X2381 @ zero_zero_int)=(zero_zero_int))), inference(variable_rename,[status(thm)],[fact_362_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J])). 0.50/0.63 thf(c_0_27, negated_conjecture, ~((ord_less_int @ (plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int) @ zero_zero_int)), inference(split_conjunct,[status(thm)],[c_0_16])). 0.50/0.63 thf(c_0_28, plain, ((plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int)=(times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ t)), inference(split_conjunct,[status(thm)],[fact_3_t])). 0.50/0.63 thf(c_0_29, plain, ![X1:int, X4:int]:(((times_times_int @ (bit0 @ X1) @ X4)=(bit0 @ (times_times_int @ X1 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_17])). 0.50/0.63 thf(c_0_30, plain, ![X1:int]:(((times_times_int @ (bit1 @ pls) @ X1)=(X1))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19]), c_0_20])). 0.50/0.63 thf(c_0_31, plain, ![X1:int, X4:int]:(((plus_plus_int @ (bit0 @ X1) @ (bit1 @ X4))=(bit1 @ (plus_plus_int @ X1 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_21])). 0.50/0.63 thf(c_0_32, plain, ![X1:int]:(((plus_plus_int @ X1 @ pls)=(X1))), inference(rw,[status(thm)],[c_0_22, c_0_23])). 0.50/0.63 thf(c_0_33, plain, ![X4:int, X1:int]:(((times_times_int @ X1 @ X4)=(times_times_int @ X4 @ X1))), inference(split_conjunct,[status(thm)],[c_0_24])). 0.50/0.63 thf(c_0_34, plain, ![X4:int, X1:int]:(((plus_plus_int @ X1 @ X4)=(plus_plus_int @ X4 @ X1))), inference(split_conjunct,[status(thm)],[c_0_25])). 0.50/0.63 thf(c_0_35, plain, ![X1:int]:(((times_times_int @ X1 @ zero_zero_int)=(zero_zero_int))), inference(split_conjunct,[status(thm)],[c_0_26])). 0.50/0.63 thf(c_0_36, negated_conjecture, ~((ord_less_int @ (plus_plus_int @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ one_one_int) @ pls)), inference(rw,[status(thm)],[c_0_27, c_0_23])). 0.50/0.63 thf(c_0_37, plain, (ord_less_int @ (times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ t) @ (times_times_int @ (plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int) @ zero_zero_int)), inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096])). 0.50/0.63 thf(c_0_38, plain, ((times_times_int @ t @ (bit1 @ (bit0 @ m)))=(plus_plus_int @ (bit1 @ pls) @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_20]), c_0_29]), c_0_29]), c_0_30]), c_0_19]), c_0_20]), c_0_31]), c_0_32]), c_0_33]), c_0_34]), c_0_19]), c_0_20])). 0.50/0.63 thf(c_0_39, plain, ![X1:int]:(((times_times_int @ X1 @ pls)=(pls))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_23]), c_0_23])). 0.50/0.63 thf(c_0_40, negated_conjecture, ~((ord_less_int @ (plus_plus_int @ (bit1 @ pls) @ (power_power_int @ s @ (number_number_of_nat @ (bit0 @ (bit1 @ pls))))) @ pls)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36, c_0_34]), c_0_19]), c_0_20])). 0.50/0.63 thf(c_0_41, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37, c_0_20]), c_0_29]), c_0_29]), c_0_30]), c_0_19]), c_0_20]), c_0_31]), c_0_32]), c_0_33]), c_0_38]), c_0_20]), c_0_29]), c_0_29]), c_0_30]), c_0_19]), c_0_20]), c_0_31]), c_0_32]), c_0_23]), c_0_39]), c_0_40]), ['proof']). 0.50/0.63 # SZS output end CNFRefutation 0.50/0.63 # Parsed axioms : 745 0.50/0.63 # Removed by relevancy pruning/SinE : 59 0.50/0.63 # Initial clauses : 913 0.50/0.63 # Removed in clause preprocessing : 22 0.50/0.63 # Initial clauses in saturation : 891 0.50/0.63 # Processed clauses : 894 0.50/0.63 # ...of these trivial : 128 0.50/0.63 # ...subsumed : 134 0.50/0.63 # ...remaining for further processing : 631 0.50/0.63 # Other redundant clauses eliminated : 80 0.50/0.63 # Clauses deleted for lack of memory : 0 0.50/0.63 # Backward-subsumed : 8 0.50/0.63 # Backward-rewritten : 41 0.50/0.63 # Generated clauses : 63 0.50/0.63 # ...of the previous two non-redundant : 61 0.50/0.63 # ...aggressively subsumed : 0 0.50/0.63 # Contextual simplify-reflections : 2 0.50/0.63 # Paramodulations : 0 0.50/0.63 # Factorizations : 0 0.50/0.63 # NegExts : 0 0.50/0.63 # Equation resolutions : 80 0.50/0.63 # Propositional unsat checks : 0 0.50/0.63 # Propositional check models : 0 0.50/0.63 # Propositional check unsatisfiable : 0 0.50/0.63 # Propositional clauses : 0 0.50/0.63 # Propositional clauses after purity: 0 0.50/0.63 # Propositional unsat core size : 0 0.50/0.63 # Propositional preprocessing time : 0.000 0.50/0.63 # Propositional encoding time : 0.000 0.50/0.63 # Propositional solver time : 0.000 0.50/0.63 # Success case prop preproc time : 0.000 0.50/0.63 # Success case prop encoding time : 0.000 0.50/0.63 # Success case prop solver time : 0.000 0.50/0.63 # Current number of processed clauses : 519 0.50/0.63 # Positive orientable unit clauses : 145 0.50/0.63 # Positive unorientable unit clauses: 29 0.50/0.63 # Negative unit clauses : 18 0.50/0.63 # Non-unit-clauses : 327 0.50/0.63 # Current number of unprocessed clauses: 58 0.50/0.63 # ...number of literals in the above : 114 0.50/0.63 # Current number of archived formulas : 0 0.50/0.63 # Current number of archived clauses : 49 0.50/0.63 # Clause-clause subsumption calls (NU) : 29144 0.50/0.63 # Rec. Clause-clause subsumption calls : 17811 0.50/0.63 # Non-unit clause-clause subsumptions : 96 0.50/0.63 # Unit Clause-clause subsumption calls : 501 0.50/0.63 # Rewrite failures with RHS unbound : 0 0.50/0.63 # BW rewrite match attempts : 256 0.50/0.63 # BW rewrite match successes : 158 0.50/0.63 # Condensation attempts : 0 0.50/0.63 # Condensation successes : 0 0.50/0.63 # Termbank termtop insertions : 68827 0.50/0.63 0.50/0.63 # ------------------------------------------------- 0.50/0.63 # User time : 0.097 s 0.50/0.63 # System time : 0.013 s 0.50/0.63 # Total time : 0.110 s 0.50/0.63 # Maximum resident set size: 5816 pages 0.50/0.63 0.50/0.63 # ------------------------------------------------- 0.50/0.63 # User time : 0.121 s 0.50/0.63 # System time : 0.014 s 0.50/0.63 # Total time : 0.135 s 0.50/0.63 # Maximum resident set size: 2956 pages 0.50/0.63 EOF